منابع مشابه
Structured Learning Modulo Theories
Modelling problems containing a mixture of Boolean and numerical variables is a long-standing interest of Artificial Intelligence. However, performing inference and learning in hybrid domains is a particularly daunting task. The ability to model this kind of domains is crucial in “learning to design” tasks, that is, learning applications where the goal is to learn from examples how to perform a...
متن کاملSkolemization Modulo Theories
Combining classical automated theorem proving techniques with theory based reasoning, such as satisfiability modulo theories, is a new approach to first-order reasoning modulo theories. Skolemization is a classical technique used to transform first-order formulas into equisatisfiable form. We show how Skolemization can benefit from a new satisfiability modulo theories based simplification techn...
متن کاملTowards Diagnosis Modulo Theories
We introduce a new flexible approach to modelbased diagnosis based on satisfiability modulo theories (SMT) solving. The idea is to translate a diagnosis problem into a SAT problem with additional theory constraints. An entirely discrete model can be translated directly into a SAT representation, but for a hybrid (continuous-discrete) model, additional numerical equalities between terms will be ...
متن کاملSatisfiability Modulo Theories
DPLL During search, DPLL states are pairs M ||F where M is a truth assignment F is a set of clauses (problem clauses + learned clauses) The truth assignment is a list of literals: either decision literals (guesses) or implied literals (by unit propagation). If literal l is implied by unit propagation from clause C ∨ l, then the clause is recorded as the explanation for l. This is written lC∨l i...
متن کاملProbabilistic Inference Modulo Theories
We present SGDPLL(T ), an algorithm that solves (among many other problems) probabilistic inference modulo theories, that is, inference problems over probabilistic models defined via a logic theory provided as a parameter (currently, propositional, equalities on discrete sorts, and inequalities, more specifically difference arithmetic, on bounded integers). While many solutions to probabilistic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2017
ISSN: 0004-3702
DOI: 10.1016/j.artint.2015.04.002